On certain C-ultrahomogeneous graphs obtained from cubic distance transitive graphs
نویسنده
چکیده
The notion of a C-ultrahomogeneous (or C-UH) graph due to D. Isaksen et al. is adapted for digraphs and applied to the cubic distance-transitive graphs considered both as graphs and digraphs when C is formed by shortest cycles and (k − 1)-paths with k = arc-transitivity. Moreover, (k − 1)powers of shortest cycles taken with orientation assignments that make these graphs become C-UH digraphs are ‘zipped’ into C-UH graphs. We do this here for the Pappus graph and the Desargues graph.
منابع مشابه
Orienting and separating distance-transitive graphs
It is shown that exactly 7 distance-transitive cubic graphs among the existing 12 possess a particular ultrahomogeneous property with respect to oriented cycles realizing the girth that allows the construction of a related Cayley digraph with similar ultrahomogeneous properties in which those oriented cycles appear minimally ”pulled apart”, or ”separated” and whose description is truly beautifu...
متن کاملPappus-Desargues digraph confrontation
Like the Coxeter graph became reattached into the Klein graph in [3], the Levi graphs of the 93 and 103 self-dual configurations, known as the Pappus and Desargues (k-transitive) graphs P and D (where k = 3), also admit reattachments of the distance-(k − 1) graphs of half of their oriented shortest cycles via orientation assignments on their common (k−1)-arcs, concurrent for P and opposite for ...
متن کاملOn C-ultrahomogeneous graphs and digraphs
The notion of a C-ultrahomogeneous graph, due to Isaksen et al., is adapted for digraphs and studied for the twelve cubic distance transitive graphs, with C formed by g-cycles and (k − 1)-paths, where g = girth and k = arc-transitivity. Excluding the Petersen, Heawood and Foster (90 vertices) graphs, one can go further by considering the (k− 1)-powers of g-cycles under orientation assignments p...
متن کاملCubic symmetric graphs of orders $36p$ and $36p^{2}$
A graph is textit{symmetric}, if its automorphism group is transitive on the set of its arcs. In this paper, we classifyall the connected cubic symmetric graphs of order $36p$ and $36p^{2}$, for each prime $p$, of which the proof depends on the classification of finite simple groups.
متن کاملOn a self-dual (1024)-configuration
A connected edge-disjoint union Y of 102 tetrahedra (copies ofK4) is constructed which is Menger graph of a self-dual (1024)-configuration and K4-ultrahomogeneous. As Y is not a line graph, we ask whether there exists a non-line-graphical K4-ultrahomogeneous Menger graph of a self-dual (n4)-configuration which is connected edge-disjoint union of n copies of K4, for n / ∈ {42, 102}. Moreover, Y ...
متن کامل